Hardware based String Matching Algorithms: A Survey

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hardware based String Matching Algorithms: A Survey

There are various string matching Algorithms which are software based but some are hardware based. The main factor of string matching algorithm is depending on searching efficiency. In this paper we have discussed about the hardware based string matching algorithms such as Brute Force, KMP, and Aho-Corasicks with their applications. There are different types of string matching algorithms which ...

متن کامل

A Survey of String Matching Approaches in Hardware

The string matching problem can be divided into two major categories, known as exact string matching and approximate string matching. Today, exact string matching is used in several applications such as network intrusion detection and IP address lookup in routers. This report focuses on these application areas and presents a survey of several exact string matching approaches in hardware. I. STR...

متن کامل

A Survey on using String Matching Algorithms for Network Security

In this paper, we make a survey of String Matching Algorithms for network security. It gives the summary of String Matching algorithms by focusing on network security and its subjects that are mainly focused in the literature. In this context, this paper first provides the introduction where it highlights some important aspects in the context of Network Security. Second, it briefly describes so...

متن کامل

Parallel String Matching Algorithms based on Dataflow

This paper presents efficient dataflow schemes for parallel string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered. Three parallel algorithms based on multiple input (and output) streams are presented. Time complexities of these parallel algorithms are O((n/d)+α), 0 ≤ α ≤ m, where n and m represent lengths of reference and pattern strings (n >> m)...

متن کامل

Parallel String Matching Algorithms

String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2014

ISSN: 0975-8887

DOI: 10.5120/15396-3898